Common-subexpression Elimination of Conditional Expressions
نویسنده
چکیده
منابع مشابه
Optimizing Polynomial Expressions by Factoring and Eliminating Common Subexpressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities for optimization. However existing compiler techniques for reducing code complexity such as common subexpression elimination and value numbering are targeted towards general purpose applications and are unable to full...
متن کاملFactoring and Eliminating Common Subexpressions in Polynomial Expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities for optimization. However existing compiler techniques for reducing code complexity such as common subexpression elimination and value numbering are targeted towards general purpose applications and are unable to full...
متن کاملEnergy Efficient Hardware Synthesis of Polynomial Expressions
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expressions in hardware consumes a lot of energy and therefore careful optimization of these expressions is important in order to achieve low energy consumption. Unfortunately, current optimization techniques for reducing c...
متن کاملThe Cost of Flattening with Common Subexpression Elimination
Compiling a solver-independent constraint model to solver input usually involves flattening, the decomposition of complex constraints into simpler expressions to suit the solver, introducing additional variables and constraints. In previous work [8], we have proposed extending flattening with common subexpression elimination (CSE) which can reduce the overhead introduced during flattening. In t...
متن کاملProgram and proof optimizations with type systems
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented in terms of types ascribed to expressions and statements, certifiable by type derivations, and the transformation component carries out the optimizations that the type derivations license. We describe dead code elimin...
متن کامل